Hierarchies for classes of priority algorithms for Job Scheduling
نویسندگان
چکیده
منابع مشابه
Genetic Algorithms for Job-Shop Scheduling Problems
The n×m minimum-makespan general job-shop scheduling problem, hereafter referred to as the JSSP, can be described by a set of n jobs {Ji}1≤j≤n which is to be processed on a set of m machines {Mr}1≤r≤m. Each job has a technological sequence of machines to be processed. The processing of job Jj on machine Mr is called the operation Ojr. Operation Ojr requires the exclusive use of Mr for an uninte...
متن کاملAgent Based Priority Heuristic for Job Scheduling on Computational Grids
A grid is an infrastructure for resource sharing. At present, many scientific applications require high computing power in processing, which can only be achieved by using the computational grid. For the selection and allocation of grid resources to current and future applications, grid job scheduling is playing a very vital role for computational grids. They constitute the building blocks for m...
متن کاملPriority Based Uplink Scheduling Scheme for WiMAX Service Classes
IEEE 802.16 standard supports five different service classes in order to support different needs of the mobile users with different QoS criteria. But, this standard doesn’t specify admission control and scheduling mechanisms and so far many solutions are proposed in the science world. In this paper we propose priority based uplink scheduling scheme for IEEE 802.16 standard that improves the QoS...
متن کاملHybrid algorithms for Job shop Scheduling Problem with Lot streaming and A Parallel Assembly Stage
In this paper, a Job shop scheduling problem with a parallel assembly stage and Lot Streaming (LS) is considered for the first time in both machining and assembly stages. Lot Streaming technique is a process of splitting jobs into smaller sub-jobs such that successive operations can be overlapped. Hence, to solve job shop scheduling problem with a parallel assembly stage and lot streaming, deci...
متن کاملModels and Algorithms for Fairness and Priority in Scheduling
In this thesis we address the problem of fair and priority scheduling. We focus our attention on systems characterized by an infinite computation, a discrete decomposition of tasks into atomic operation and a known-a-priori set of precedence-constraints among the activities to be performed. We analyze two fairness and two priority specifications related to the frequency of occurrence of activit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2006
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2005.10.045